Dimension and embedding theorems for geometric lattices
نویسندگان
چکیده
منابع مشابه
Dimension and Embedding Theorems for Geometric Lattices
Let G be an n-dimensional geometric lattice. Suppose that 1 < e, f < n 1, e + f > n, but e and f are not both n 1. Then, in general, there are E, FE G with dimE=e, dimF=f, EvF=l, and dimEhF=e+f-n-l; any exception can be embedded in an n-dimensional modular geometric lattice M in such a way that joins and dimensions agree in G and M, as do intersections of modular pairs, while each point and lin...
متن کاملTwo Embedding Theorems for Finite Lattices
Introduction. One of the important unsolved problems of lattice theory is the problem of embedding every finite lattice in a finite partition lattice. The partition lattice can be considered as the lattice of subspaces of a suitable geometry. By slightly loosening the conditions on this geometry it will be shown that every finite lattice can be embedded in the lattice of subspaces of a finite g...
متن کاملGeometric, Algebraic, and Analytic Descendants of Nash Isometric Embedding Theorems
Is there anything interesting left in isometric embeddings after the problem had been solved by John Nash? We do not venture a definite answer, but we outline the boundary of our knowledge and indicate conjectural directions one may pursue further. Our presentation is by no means comprehensive. The terrain of isometric embeddings and the fields surrounding this terrain are vast and craggy with ...
متن کاملSubnormal Embedding Theorems for Groups
In this paper we establish some subnormal embeddings of groups into groups with additional properties; in particular embeddings of countable groups into 2-generated groups with some extra properties. The results obtained are generalizations of theorems of P. Hall, R. Dark, B. Neumann, Hanna Neumann, G. Higman on embeddings of that type. Considering subnormal embeddings of finite groups into fin...
متن کاملCoding Theorems for Reversible Embedding
We consider embedding of messages (data-hiding) into i.i.d. host sequences. As in Fridrich et al. [2002] we focus on the case where reconstruction of the host sequence from the composite sequence is required. We study the balance between embedding rate and embedding distortion. First we determine the distortion-rate region corresponding to this setup. Then we generalize this result in two direc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1974
ISSN: 0097-3165
DOI: 10.1016/0097-3165(74)90005-3